Subcritical bootstrap percolation via Toom contours

نویسندگان

چکیده

In this note we provide an alternative proof of the fact that subcritical bootstrap percolation models have a positive critical probability in any dimension. The relies on recent extension classical framework Toom. This approach is not only simpler than original multi-scale renormalisation result two and more dimensions, but also gives significantly better bounds. As byproduct, improve best known bounds for stability threshold Toom’s North-East-Center majority rule cellular automaton.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Subcritical U-bootstrap Percolation Models Have Non-trivial Phase Transitions

We prove that there exist natural generalizations of the classical bootstrap percolation model on Z that have non-trivial critical probabilities, and moreover we characterize all homogeneous, local, monotone models with this property. Van Enter [28] (in the case d = r = 2) and Schonmann [25] (for all d > r > 2) proved that r-neighbour bootstrap percolation models have trivial critical probabili...

متن کامل

Largest cluster in subcritical percolation

The statistical behavior of the size (or mass) of the largest cluster in subcritical percolation on a finite lattice of size N is investigated (below the upper critical dimension, presumably d(c)=6). It is argued that as N-->infinity the cumulative distribution function converges to the Fisher-Tippett (or Gumbel) distribution e(-e(-z)) in a certain weak sense (when suitably normalized). The mea...

متن کامل

Local Bootstrap Percolation

We study a variant of bootstrap percolation in which growth is restricted to a single active cluster. Initially there is a single active site at the origin, while other sites of Z2 are independently occupied with small probability p, otherwise empty. Subsequently, an empty site becomes active by contact with two or more active neighbors, and an occupied site becomes active if it has an active s...

متن کامل

Bootstrap Percolation in Three Dimensions

Abstract. By bootstrap percolation we mean the following deterministic process on a graph G. Given a set A of vertices ‘infected’ at time 0, new vertices are subsequently infected, at each time step, if they have at least r ∈ N previously infected neighbours. When the set A is chosen at random, the main aim is to determine the critical probability pc(G, r) at which percolation (infection of the...

متن کامل

Slow Convergence in Bootstrap Percolation

In the bootstrap percolation model, sites in an L by L square are initially infected independently with probability p. At subsequent steps, a healthy site becomes infected if it has at least 2 infected neighbours. As (L, p) → (∞, 0), the probability that the entire square is eventually infected is known to undergo a phase transition in the parameter p log L, occurring asymptotically at λ = π2/1...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Electronic Communications in Probability

سال: 2022

ISSN: ['1083-589X']

DOI: https://doi.org/10.1214/22-ecp496